Method for generating register transfer level code

ABSTRACT

A method for generating a register transfer level code, comprising the steps of: generating the generalized register transfer level code without considering process conditions; separating all logic gates into either a combinational logic circuit or a sequential logic circuit; transforming the register transfer level code of the separated combinational logic circuits and sequential logic circuits into each equivalent register transfer level code; and simplifying the combinational logic circuits and the sequential logic circuits into one simple code.

FIELD OF THE INVENTION

[0001] The present invention relates to a method for generating a register transfer level (RTL) code for a very large scale integrated circuit VLSI design.

DESCRIPTION OF THE RELATED ART

[0002] Generally, numerous logic circuits are integrated into a single chip by a very large scale integrated circuit VLSI technology. Due to the increased number of logic circuits comprising the highly integrated circuit, however, each logic circuit cannot be designed separately by programmers. Therefore, a timing delay in each logic circuit and a timing error can be occur when numerous logic circuits are integrated in a short period of time.

[0003] In order to solve these problems, a core logic, also known as an intelligent property, is employed. In the core logic, the timing delay and the timing errors are verified.

[0004] However, the core logic is verified only under specific conditions and configured in a gate level or circuit level. Therefore, if the core logic is configured under other process conditions, it has to be reconfigured requiring additional time.

[0005] However, a method for expressing each logic circuit to a RTL code. A characteristic of the RTL code is that the process condition can be changed. However, if the number of logic circuits comprising the VLSI is increased, the length of the RTL code is increased, which reduces the recognition of the RTL code. Therefore, this method is not the proper solution as is the case with core logic.

[0006]FIG. 1 is a general circuit diagram of a method for generating an ordinary RTL code in accordance with the present invention.

[0007] Referring to FIG. 1, the circuit includes two AND gates 10 and 20, an OR gate 30, a D flip-flop 40 and a three-state buffer 50. The circuit in FIG. 1 can be described in RTL as shown in Table 1. The first AND gate 10 is expressed as (a) in Table 1 so that an AND gate AND02D1, which is verified in a certain process condition, is used by the first AND gate 10. However, signals A and B become input terminals and a signal E becomes an output terminal. The second AND gate 20 is expressed as (b) in Table 1 so that an AND gate AND02D2, which is verified in a certain process condition, is used by the second AND gate 20. However, signals C and D become input terminals and a signal F becomes an output terminal.

[0008] The terms “and2_0” and “and2_1” in Table 1 are called “instance” and they are expressions for distinguishing each AND gate. That is, designing the VLSI by the instance distinguishes the first and second AND gates and2_0 and and2_1.

[0009] The D flip-flop 40 is described as (c) in Table 1 and synchronized with a clock CLK1 to output an input D to an output terminal D_L1.

[0010] In the OR gate 30, a verified device OR02D2 is employed as the tool for designing the VLSI so that E and F become input terminals and “O1_T” becomes an output terminal.

[0011] The three-state buffer 50 is described as (e) in Table 1 so that “O1_OE” becomes an input terminal and “O1_T” becomes an output terminal. At this point, the three-state buffer 50 is controlled by a signal applied from a terminal O1 in order to output an output signal. TABLE 1 (a) AND02D1 and2_0(.Al(A), .A2(B), .Z(E)); (b) AND02D2 and2_1(.Al(C), .A2(D), .Z(F)); (c) DFF dff_0(.clk(CLK1), .D(D), .Q(D_L1)); (d) OR02D1 or2_0 (.A1(E), A2(F), .ZN(O1_T)); (e) TRB1 trb1_1(.OE(O1_OE), .I(O1_T), .(O1));

[0012] The description for writing each logic circuit can be varied depending on the tool and its version.

[0013] In the prior art, the RTL code is employed in consideration of the timing delay and error. In the D flip-flop 40 and the three-state buffer 50, the separate delay time, timing and process condition have to be given in order to implement all the logic gates 10 through 50, which comprise logic circuits, to hardware devices during the compilation.

[0014] If the process condition, such as width of metal line, current capacity of device and driving capability of the integrated circuit is changed, AND gates 10 and 20 and the OR gate 30 in the RTL code, which is written in a register transfer level code, must be changed.

[0015] Therefore, the RTL code has to be re-written with respect to the process condition if the existent circumstances, where hundreds of thousands of core logics are integrated, are to be taken into consideration.

[0016] Furthermore, when the VLSI over hundreds of thousands gates is designed with the register transfer level in the prior art, the length of the RTL code is exceedingly increased so that the process conditions in the RTL code has to be changed.

SUMMARY OF THE INVENTION

[0017] It is, therefore, an object of the present invention to provide a method for generating a register transfer level code.

[0018] In accordance with an aspect of the present invention, there is provided a method for generating a register transfer level code, comprising the steps of: generating the generalized register transfer level code without considering the process conditions; separating all logic gates into either a combinational logic circuit or a sequential logic circuit; transforming the register transfer level code of the separated combinational logic circuits and sequential logic circuits into each equivalent register transfer level code; and simplifying the combinational logic circuits and the sequential logic circuits into one simple code.

[0019] In accordance with another aspect of the present invention, there is provided a storage media for executing a method for generating a register transfer level code, comprising instructions performing the steps of: generalizing each register transfer level code of a combinational logic circuit and a sequential logic circuit; separating the register transfer level codes of the generalized combinational logic circuit and the sequential logic circuit; transforming the register transfer level code of the separated combinational logic circuits and sequential logic circuits into each equivalent register transfer level code; and simplifying the combinational logic circuits and the sequential logic circuits into one simple code.

[0020] In accordance with still another aspect of the present invention, there is provided a storage media for executing a method for generating a register transfer level code in a logic circuit having a three-state buffer, comprising instructions performing the steps of: generating the generalized register transfer level code without considering the process conditions; separating all logic gates into either a combinational logic circuit or a sequential logic circuit; transforming the register transfer level code of the separated combinational logic circuits and sequential logic circuits into each equivalent register transfer level code; and simplifying the combinational logic circuits and the sequential logic circuits into one simple code.

BRIEF DESCRIPTION OF THE DRAWINGS

[0021] The above and other objects and features of the present invention will become apparent from the following description of the preferred embodiments taken in conjunction with the accompanying drawings, in which:

[0022]FIG. 1 is a general circuit diagram of a method for generating an ordinary RTL code in accordance with the present invention;

[0023]FIG. 2 is a logic block diagram describing the present invention;

[0024]FIG. 3 is a flow chart of a method for generating a RTL in accordance with the present invention;

[0025]FIG. 4A is a general circuit diagram and its RTL code in accordance with the present invention; and

[0026]FIGS. 4B through 4G are diagrams of methods for generating the RTL code in FIG. 4A in accordance with the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0027] Hereinafter, a method for generating the RTL code according to the present invention will be described in detail with reference to the accompanying drawings.

[0028]FIG. 2 is a logic block diagram for describing the present invention.

[0029] In FIG. 2, block C/B stands for a combinational circuit and block S/B stands for a sequential circuit block. All blocks in FIG. 2 can be simplified into either the combination circuit block C/B or the sequential circuit block S/B.

[0030] As shown in FIG. 2, an output signal Rout2 from a reference module 60 and an output signal from the sequential circuit block 70 can be input signals to the combinational circuit block 80. Also, an input signal to the sequential circuit block S/B and an input signal Rin2 to the reference module can be an output signal from the combinational circuit block C/B.

[0031] However, an output signal Rout1 from the reference module 60, the output signal from the combinational circuit block 80 and the output signal from the sequential circuit block ______ can be an input signal to the sequential circuit block. Also the input signal to the combinational circuit block C/B, the input signal to the sequential circuit block S/B and an input signal Rin1 to the reference module can be the output signal from the sequential circuit block S/B.

[0032]FIG. 3 is a flow chart of a method for generating a code of a register transfer level in accordance with the present invention.

[0033] In FIG. 3, the flow chart includes: a step of generalizing all logic gates depending on their function 100; a step of separating all logic gates into either the combinational logic circuit or the sequential logic circuit 200; a step of transforming the register transfer level code of the separated combinational logic circuits and sequential logic circuits into each equivalent register transfer level code 300; and a step of simplifying the combinational logic circuits and the sequential logic circuits into one simple code 400.

[0034] The step of transforming the register transfer level code of the separated combinational logic circuits and sequential logic circuits into each equivalent register transfer level code 300 includes: a step of transforming RTL code of the combinational logic circuits and the sequential logic circuits into each of equivalent arithmetic expressions 310; a step of assigning each of equivalent arithmetic expressions under corresponding groups 320; and a step of transforming each of grouped arithmetic expressions into a procedural assignment statement 330.

[0035]FIG. 4A is a general circuit diagram and its RTL code in accordance with the present invention. However, the detailed description of the diagram is shown in FIG. 4B through FIG. 4G. FIGS. 4B through 4G are diagrams of methods for generating RTL code in FIG. 4A in accordance with the present invention.

[0036] Referring to FIG. 4B, input and output signals of all logic gates shown in FIG. 4A are generalized, which means they do not include a process condition.

[0037] Meanwhile, a D flip-flop 140 and a three-state buffer 150 are identical to the prior art. However, AND gates 110, 120 and an OR gate 130 are generalized. That is, the AND gate 110 is written as “AND02 and2_0 (.I1(A), .I2(B), .O1(E));”, the AND gate 120 is written as “AND02 and2_1 (.I1(C), .I2(D_L1), .O1(F));” and the OR gate 130 is written as “OR02 or 2_0(.I1(E), .I2(F), O.1(01_T));”.

[0038] In the present invention, the AND gate 110 is expressed as an AND gate AND02 having only two input terminals rather than as the AND gate AND02D1, where D1 means a process condition such as width of metal line, current capacity of device and driving capability as in the prior art.

[0039] Furthermore, input terminals are expressed as “.I1” and “.I2” and an output terminal is expressed as “.O1”.

[0040] Referring to FIG. 4C, combinational logic gates 110, 120, 130 and sequential logic gates 140, 150 are distinguished and grouped into either a sequential logic circuit or a combinational logic circuit.

[0041] Actually, a plurality of three-state buffers are included in most VLSI devices. In the present invention, the three-state buffer is mapped into the sequential logic circuit so that all VLSI devices can be mapped into either the sequential logic circuit or the combinational logic circuit.

[0042] Referring to FIG. 4D, each of combinational logic gates 110, 120, 130 is transformed into each of equivalent arithmetic expressions.

[0043] The generalized AND gate 110 is expressed as “assign E=A&B;”, the generalized AND gate 120 is expressed as “assign F=C&D_L1;” and the generalized OR gate 130 is expressed as “assign O1_T=E|F;”. That is, the generalized AND gate 110 receives and performs an AND operation on signals A and B to generate an output signal E. The generalized AND gate 120 receives and performs an AND operation on signals C and D_L1 to generate an output signal F. The generalized OR gate 130 receives and performs an OR operation on signals E and F in order to generate an output signal O1_T.

[0044] Referring to FIG. 4E and FIG. 4F, each of combinational logic gates 110, 120, 130 is expressed as an arithmetic expression depending on their inputs and outputs and becomes a combinational logic circuit. A step of transforming RTL code of the combinational logic circuits and sequential logic circuits into each of equivalent arithmetic expression 310 and a step of transforming each of grouped arithmetic expressions into a procedural assignment statement 330 are described in FIG. 4E and FIG. 4F.

[0045] Referring to FIG. 4E, each of the output signals E, F and O1_T is substituted into the arithmetic expressions until the final output signal becomes O1_T and the input signals become A, B, C and D_L1. That is, the output signals of the AND gate 110 are expressed as “A&B” and the output signals of the AND gate 120 are expressed as “C&D_1”. The OR gate 130 performs an OR operation on the output signals of the AND gates 110 and 120. Therefore, the output signal of the OR gate 130 can be expressed as “O1_T=(A&B)|(C&D_L1)”.

[0046] Therefore, the RTL code of the combinational logic gates 110, 120 130 is simplified into one simple RTL code, enhancing the recognition of the RTL code.

[0047] Referring to FIG. 4F, the RTL code of the sequential logic gates 140, 150 is transformed into the procedural assignment statement to enhance the recognition of the RTL code. That is, the D flip-flop 140 is expressed as “DFF dff_0(clk(CLK1), .D(D), .Q(D_L1));” in the prior art, but the D flip-flop 140 of the present invention is expressed as “always(posedge CLK1) if(CLK1)D_L1<=D”.

[0048] In the expression “always(posedge CLK1) if(CLK1)D_L1<=D”, an input “D” is outputted as “D_L1” when CLK1 is a positive edge.

[0049] Referring to FIG. 4G, each arithmetic expression of the combinational logic gate and the sequential logic gate is grouped into one and stored. The RTL code in FIG. 4G does not include any conditions, such as width of metal line, current capacity of device and driving capability, and the recognition of the RTL code is improved compared to the prior art.

[0050] In the prior art, when the process conditions are changed, the time is wasted because of the core logic. However, the present invention is not affected by the process conditions.

[0051] In the present invention, the RTL code is not affected by the process conditions and the length of the RTL code is shorter than the prior art so that the recognition of the RTL code is extremely superior.

[0052] The method for generating the RTL code in accordance with the present invention refers to a Verilog/XL reference manual, Cadence Design System. However, this reference is just one example. The present invention is not limited to this reference and may be applied to other VLSI tools.

[0053] While the present invention has been described with respect to the particular embodiments, it will be apparent to those skilled in the art that various changes and modifications may be made without departing from the spirit and scope of the invention as defined in the following claims. 

What is claimed is:
 1. A method for generating a register transfer level code, comprising steps of: a) generating the generalized register transfer level code without considering process conditions; b) separating all logic gates into either a combinational logic circuit or a sequential logic circuit; c) transforming the register transfer level code of the separated combinational logic circuits and sequential logic circuits into each equivalent register transfer level code; and d) simplifying the combinational logic circuits and the sequential logic circuits into one simple code.
 2. The method as recited in claim 1, wherein the step c) includes steps of: a) transforming the register transfer level code of the combinational logic circuits and the sequential logic circuits into each of equivalent logics; b) transforming the register transfer level code of the generalized combinational logic circuits and the generalized sequential logic circuits into each of equivalent arithmetic expressions; c) assigning each of equivalent arithmetic expressions under corresponding groups; and d) transforming each of grouped arithmetic expressions into a procedural assignment statement.
 3. The method as recited in claim 1, wherein the step a) unifies a logic unit having an identical logic function and unit of inputs and outputs to the combinational logic circuit.
 4. A method for generating the register transfer level code including a three-state buffer, comprising steps of: a) generating a generalized register transfer level code without considering process conditions; b) separating all logic gates into either the combinational logic circuit or the sequential logic circuit and including the three-state buffer into the sequential logic circuit; c) transforming the register transfer level code of the separated combinational logic circuits and sequential logic circuits into each equivalent register transfer level code; d) simplifying the combinational logic circuits and the sequential logic circuits into one simple code.
 5. The method as recited in claim 4, wherein the step c) includes steps of: a) transforming the register transfer level code of the generalized combinational logic circuits and the generalized sequential logic circuits having the three-state buffer into each of equivalent arithmetic expressions; b) assigning each of equivalent arithmetic expressions under corresponding groups; and c) transforming each of grouped arithmetic expressions into a procedural assignment statement.
 6. The method as recited in claim 4, wherein the step a) unifies a logic unit having an identical logic function and unit of inputs and outputs to the combinational logic circuit.
 7. A storage media for executing a method for generating a register transfer level code, comprising instructions performing steps of: a) generalizing each register transfer level code of a combinational logic circuit and a sequential logic circuit; b) separating the register transfer level codes of the generalized combinational logic circuit and the sequential logic circuit; c) transforming the register transfer level code of the separated combinational logic circuits and sequential logic circuits into each equivalent register transfer level code; and d) simplifying the combinational logic circuits and the sequential logic circuits into one simple code.
 8. A storage media for executing a method for generating a register transfer level code in a logic circuit having a three-state buffer, comprising instructions performing steps of: a) generating the generalized register transfer level code without considering process conditions; b) separating all logic gates into either a combinational logic circuit or a sequential logic circuit; c) transforming the register transfer level code of the separated combinational logic circuits and sequential logic circuits into each equivalent register transfer level code; and d) simplifying the combinational logic circuits and the sequential logic circuits into one simple code. 